Weyl and Bernstein numbers of embeddings of Sobolev spaces with dominating mixed smoothness
نویسندگان
چکیده
منابع مشابه
Function spaces with dominating mixed smoothness
Acknowledgements I would like to express my deepest appreciation to my supervisors Professor Hans-Jürgen Schmeisser and Professor Winfried Sickel for their support and many hints and comments. I thank also Professor Hans Triebel for many valuable discussions on the topic of this work.
متن کاملOn approximation numbers of Sobolev embeddings of weighted function spaces
We investigate asymptotic behaviour of approximation numbers of Sobolev embeddings between weighted function spaces of Sobolev–Hardy–Besov type with polynomials weights. The exact estimates are proved in almost all cases. © 2005 Elsevier Inc. All rights reserved.
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولGelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
We consider the problem of determining the asymptotic order of the Gelfand numbers of mixed(quasi-)norm embeddings lp(l d q) →֒ l b r(l d u) given that p ≤ r and q ≤ u, with emphasis on cases with p ≤ 1 and/or q ≤ 1. These cases turn out to be related to structured sparsity. We obtain sharp bounds in a number of interesting parameter constellations. Our new matching bounds for the Gelfand number...
متن کاملSharp Embeddings of Besov Spaces with Logarithmic Smoothness
We prove sharp embeddings of Besov spaces B p,r (R ) with the classical smoothness σ and a logarithmic smoothness α into Lorentz-Zygmund spaces. Our results extend those with α = 0, which have been proved by D. E. Edmunds and H. Triebel. On page 88 of their paper (Math. Nachr. 207 (1999), 79–92) they have written: “Nevertheless a direct proof, avoiding the machinery of function spaces, would be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2016
ISSN: 0885-064X
DOI: 10.1016/j.jco.2016.04.004